Diclib.com
Diccionario ChatGPT

Búsqueda en el diccionario Soluciones personalizadas

Ingrese una palabra o frase en cualquier idioma 👆

Idioma:

Traducción y análisis de palabras por inteligencia artificial ChatGPT

En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:

cómo se usa la palabra
frecuencia de uso
se utiliza con más frecuencia en el habla oral o escrita
opciones de traducción
ejemplos de uso (varias frases con traducción)
etimología

Qué (quién) es moderately hard - definición

COMPLEXITY CLASS

NP hard; Np hard; Np-hard; NP-Hard Problem; NP-HARD; NP-hard problems; NP-Hard; NP-hard

Hard (Zürich)

QUARTER OF THE CITY OF ZURICH, SWITZERLAND

Hard (Zuerich); Hard (Zurich); Zürich-Hard

Hard is a quarter in the district 4 of Zürich. It was formerly a part of Aussersihl municipality, which was incorporated into Zürich in 1893.

https://en.wikipedia.org/wiki/Hard_(Zürich)

hard-coded

SOFTWARE DEVELOPMENT PRACTICE OF EMBEDDING DATA INTO THE SOURCE CODE

Hardcoding; Hard coded; Hardcoded; Hard code; Hard-coded; Hardcode; Hard-coding; Hardcoded value; Hard coded value; Hard coded values; Hardcoded values; Hard-coded value; Hard-coded values

<jargon> (By analogy with "hard-wired") Said of a data value or behaviour written directly into a program, possibly in multiple places, where it cannot be easily modified. There are several alternatives, depending on how often the value is likely to change. It may be replaced with a compile-time constant, such as a C "#define" macro, in which case a change will still require recompilation; or it may be read at run time from a profile, resource (see de-rezz), or environment variable that a user can easily modify; or it may be read as part of the program's input data. To change something hard-coded requires recompilation (if using a compiled language of course) but, more seriously, it requires sufficient understanding of the implementation to be sure that the change will not introduce inconsistency and cause the program to fail. For example, "The line terminator is hard-coded as newline; who in their right mind would use anything else?" See magic number. [Jargon File] (1999-10-18)

Hard coding

SOFTWARE DEVELOPMENT PRACTICE OF EMBEDDING DATA INTO THE SOURCE CODE

Hardcoding; Hard coded; Hardcoded; Hard code; Hard-coded; Hardcode; Hard-coding; Hardcoded value; Hard coded value; Hard coded values; Hardcoded values; Hard-coded value; Hard-coded values

Hard coding (also hard-coding or hardcoding) is the software development practice of embedding data directly into the source code of a program or other executable object, as opposed to obtaining the data from external sources or generating it at runtime. Hard-coded data typically can only be modified by editing the source code and recompiling the executable, although it can be changed in memory or on disk using a debugger or hex editor.

https://en.wikipedia.org/wiki/Hard_coding

Wikipedia

NP-hardness

In computational complexity theory, NP-hardness (non-deterministic polynomial-time hardness) is the defining property of a class of problems that are informally "at least as hard as the hardest problems in NP". A simple example of an NP-hard problem is the subset sum problem.

A more precise specification is: a problem H is NP-hard when every problem L in NP can be reduced in polynomial time to H; that is, assuming a solution for H takes 1 unit time, H's solution can be used to solve L in polynomial time. As a consequence, finding a polynomial time algorithm to solve any NP-hard problem would give polynomial time algorithms for all the problems in NP. As it is suspected that P≠NP, it is unlikely that such an algorithm exists.

It is suspected that there are no polynomial-time algorithms for NP-hard problems, but that has not been proven. Moreover, the class P, in which all problems can be solved in polynomial time, is contained in the NP class.

https://en.wikipedia.org/wiki/NP-hardness